A heuristic algorithm for survivable mapping in IP-over-WDM networks
نویسندگان
چکیده
Survivability is an important issue in IP-over-WDM networks. IP layer failure recovery is possible only if the IP topology is mapped onto the WDM topology in a survivable way, i.e., the failure of any single fiber will not disconnect the IP topology. This problem has been proven NP-hard in [1]. And an integer linear programming (ILP) formulation that solves this problem is provided in [2]. We present a polynomial time heuristic algorithm for the survivable mapping problem named Map-and-Fix. The key idea of Map-and-Fix is to first compute a mapping that is likely to be survivable or close to survivable; if the mapping is not survivable, then it is transformed to a survivable mapping by rerouting some of the IP links. Simulation studies showed that Map-and-Fix runs much faster than ILP and can find survivable mappings for most of the test cases. In addition, the obtained mappings are close to optimal.
منابع مشابه
Survivable Routing in IP-over-WDM Networks in the Presence of Multiple Failures
Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way that a failure at the WDM layer leaves the IP topology connected. Such a mapping is called survivable. As finding a survivable mapping is known to be NP-complete, in practice it requires a heuristic approach. We have introduced in [1] a novel algorithm called “SMART”, th...
متن کاملSurvivable Mapping Algorithm by Ring Trimming
We develop a fast and efficient algorithm that finds a survivable (i.e., robust to single fiber failures) mapping of IP topology on the mesh of fibers in IP-over-WDM networks; we call it SMART. A number of algorithms solving this problem can be found in the literature. Since ILP solutions are highly complex, many heuristics were proposed. They usually start with some initial mapping and then tr...
متن کاملBounds for Energy-Efficient Survivable IP Over WDM Networks With Network Coding
In this work we establish analytic bounds for the energy efficiency of the 1+1 survivable IP over WDM networks using network coding. The analytic bounds are shown to be in close agreement with our previously reported results. They provide verification of the MILP and heuristics proposed previously and an efficient, compact means of evaluating the network results, and allow the performance of la...
متن کاملSurvivable routing in IP-over-WDM networks: An efficient and scalable local search algorithm
In IP-over-WDM networks, a logical IP network is routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm for survivable routing. The algorithm w...
متن کاملPolynomial Time Algorithm (PTA) to generate a survivable ring virtual topology for Optical WDM based on the Hamiltonian Circuit Detection Heuristics(HCDH)
The Routing and Wavelength Assignment (RWA) problem is known to be NP-hard for general Physical Topology (PT) in optical networks. We have analyzed the survivability of the optical network under Survivable Routing and Shared Path Protection (SPP) for various topologies and suggested two survivable RWA algorithms which are shown to perform better under certain performance matrix by simulation. G...
متن کامل